A Conflict Avoidance Data Allocation Algorithm in a Multi-channel Broadcast Environment
نویسندگان
چکیده
On-demand broadcast is an effective data dissemination approach in mobile computing. Recently, a large number of applications have been developed in broadcast systems equipped with multiple channels. In this study, we investigate the data scheduling issues arising in multichannel on-demand broadcast. The bandwidth utilization problem, which renders a poor performance of existing algorithms, is explored and examined. To tackle the observed problem, a novel scheduling algorithm is proposed, which aims at avoiding the conflict in data allocation and therewith, improving the bandwidth utilization. Results from our simulation study demonstrate the superiority of the proposed algorithm.
منابع مشابه
Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملConflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models
In this paper, we shall first propose an optimal conflict-free parallel sorting algorithm under the single-channel broadcast communication model. The time complexity of this algorithm is O((n/p)log(n/p)+n) if p processors are used to sort n data elements. We then apply our single--channel sorting algorithm to improve the multi-channel sorting algorithm proposed by Marberg and Gafni. Since there...
متن کاملOptimal Power Management to Minimize SER in Amplify and-Forward Relay Networks
This paper studies optimal power allocation to minimize symbol error rate (SER) of amplify-and-forward cooperative diversity networks. First, we analytically solve optimal power allocation problem to minimize SER for three different scenarios, namely, multi-branch single-relay, single-branch multi-relay and multi-branch multi-relay cooperative diversity networks, all subject to a given total re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JNW
دوره 5 شماره
صفحات -
تاریخ انتشار 2010